Natarajan Shankar  Home/Search
Context Related
| sri.com/pub/users/shankar/floc02.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiowa.edu/combination/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of thought. One school, best represented by Alan Robinson's resolution method, is based on simple uniform proof search procedures guided by heuristics. The other school, pioneered by Hao Wang, argues for problem-specific combinations of decision and semi-decision procedures. While the former school has been dominant in the... (Update)
Context of citations to this paper: More
.... from more than one theory, what one really needs is the integration of these little engines of proof into a single ecient tool [12]. Several such systems have been designed [5, 15] and used in a variety of applications: general purpose theorem provers, static analysis,...
...[19] has been a cornerstone for implementation of automated veri cation tools based on combining decision procedures. In a recent survey [17], Shankar discusses the promise and success of such tools, stressing also the need for stronger theoretical support. Clarifying...
Cited by: More
Canonization for Disjoint Unions of Theories - Krstic, Conchon (2003) (Correct)
Strategies for Combining Decision Procedures - Conchon, Krstic (2003) (Correct)
Technical Report SRI-CSL-03-05 - November Updated January (Correct)
Active bibliography (related documents): More All
1.2: Combining Shostak Theories - Shankar, Rueß (2002) (Correct)
0.7: Discoveries and Experiments in the Automation of Mathematical.. - Shults (2002) (Correct)
0.5: The Combination Problem in Automated Reasoning - Zarba (2004) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Verification by Abstraction - Shankar (Correct)
0.2: Experiments in Theorem Proving and Model Checking for.. - Havelund, Shankar (1996) (Correct)
0.2: An Introduction to Formal Specification and Verification using.. - Rushby, al. (1991) (Correct)
Related documents from co-citation: More All
5: Combining Shostak theories - Shankar, Rue - 2002
5: Deconstructing Shostak - Rue, Shankar - 2001
4: A generalization of Shostak's method for combining decision procedures - Barrett, Dill et al. - 2002
BibTeX entry: (Update)
N. Shankar. Little engines of proof. In L.-H. Eriksson and P. Lindsay, editors, FME 2002: Formal Methods - Getting IT Right, pages 1-20, Copenhagen, 2002. Springer-Verlag. http://citeseer.ist.psu.edu/shankar02little.html More
@inproceedings{ shankar02little,
author = "N. Shankar",
title = "Little engines of proof",
editor = "L.-H. Eriksson and P. Lindsay",
booktitle = "{FME} 2002: Formal Methods --- Getting {IT} Right, Copenhagen",
pages = "1--20",
publisher = "Springer-Verlag",
year = "2002",
url = "citeseer.ist.psu.edu/shankar02little.html" }
Citations (may not include all citations):1726 Graph-based algorithms for Boolean function manipulation - Bryant - 1986
779 Symbolic model checking: 10 states and beyond - Burch, Clarke et al. - 1992
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1993
566 Proof-carrying code - Necula - 1997
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
399 The algorithmic analysis of hybrid systems - Alur, Courcoubetis et al. - 1995
392 A Computational Logic (context) - Boyer, Moore - 1979
295 PVS: A prototype verification system (context) - Owre, Rushby et al. - 1992
270 Bandera: Extracting finite-state models from Java source cod.. - Corbett, Dwyer et al. - 2000
270 Formal verification for fault-tolerant architectures: Proleg.. - Owre, Rushby et al. - 1995
231 Model checking and abstraction - Clarke, Grumberg et al. - 1992
229 A Decision Method for Elementary Algebra and Geometry (context) - Tarski - 1948
224 Model-checking in dense real-time - Alur, Courcoubetis et al. - 1993
200 Construction of abstract state graphs with PVS - Graf, Sadi - 1997
164 A practical algorithm for exact array dependence analysis (context) - Pugh - 1992
154 Simplification by cooperating decision procedures (context) - Nelson, Oppen - 1979
150 Edinburgh LCF: A Mechanized Logic of Computation (context) - Gordon, Milner et al. - 1979
141 COMPAQ Systems Research Center (context) - Detlefs, Rustan et al. - 1998
133 Quantifier elimination for real closed fields by cylindrical.. (context) - Collins - 1975
121 Prolegomena to a theory of mechanized formal reasoning (context) - Weyhrauch - 1980
121 Deciding combinations of theories (context) - Shostak - 1984
107 Automatic predicate abstraction of C programs - Ball, Majumdar et al. - 2001
97 Integrating decision procedures into heuristic theorem prove.. - Boyer, Moore - 1986
96 Property preserving abstractions for the verification of con.. - Loiseaux, Graf et al. - 1995
87 Fourier-Motzkin elimination and its dual (context) - Dantzig, Eaves - 1973
78 Experience with predicate abstraction - Das, Dill et al. - 1999
76 Partial cylindrical algebraic decomposition (context) - Collins, Hong - 1991
74 ComputerAided Reasoning: An Approach (context) - Kaufmann, Manolios et al. - 2000
71 Metafunctions: Proving them correct and using them e#ciently.. (context) - Boyer, Moore - 1981
70 Computing abstractions of infinite state systems composition.. - Bensalem, Lakhnech et al.
69 cient SAT solver (context) - Moskewicz, Madigan et al. - 2001
53 Deciding linear inequalities by computing loop residues (context) - Shostak - 1981
51 Decidable theories (context) - Rabin - 1978
49 A new correctness proof of the NelsonOppen combination proce.. - Tinelli, Harandi - 1996
49 GRASP: A search algorithm for propositional satisfiability (context) - Marques-Silva, Sakallah - 1999
46 and Doron Peled (context) - Clarke, Grumberg - 1999
43 Theorem proving in arithmetic without multiplication (context) - Cooper - 1972
40 Successive approximation of abstract transition relations (context) - Das, Dill - 2001
38 Resolution theorem proving - Bachmair, Ganzinger
38 Non-resolution theorem proving (context) - Bledsoe - 1977
37 Uber die vollstandigkeit eines gewissen systems der arithmet.. (context) - Presburger - 1929
35 pn upper bound on the complexity of Presburger arithmetic (context) - Oppen - 1978
33 Handbook of Automated Reasoning (context) - Robinson, Voronkov - 2001
32 Xerox Palo Alto Research Center (context) - Nelson, program et al. - 1981
32 Automata-Theoretic Verification of Coordinating Processes (context) - Kurshan - 1993
31 Series of abstractions for hybrid automata - Tiwari, Khanna - 2002
30 Lazy theorem proving for bounded model checking over infinit.. - de Moura, Rue et al. - 2002
30 A comparison of Presburger engines for EFSM reachability - Shiple, Kukula et al.
27 cient propositional prover (context) - Zhang, An - 1997
26 Abstract and model check while you prove (context) - Sadi, Shankar - 1999
26 Generating finite-state abstractions of reactive systems usi.. - Colon, Uribe
25 Abstracting WS1S systems to verify parameterized networks - Baukus, Bensalem et al. - 2000
24 InVeSt: A tool for the verification of invariants - Bensalem, Lakhnech et al.
22 Checking satisfiability of first-order formulas by increment.. - Barrett, Dill et al. - 2002
21 Perspectives in Mathematical Logic (context) - Borger, Gradel et al. - 1997
19 A tutorial on Stalmarck's proof procedure for propositional .. - Sheeran, Stalmarck - 2000
18 Combining Shostak theories - Shankar, Rue - 2002
18 New techniques for WS1S and WS (context) - Elgaard, Klarlund et al.
18 Introduction to a general theory of elementary propositions (context) - Post - 1921
17 Equations and rewrite rules: a survey (context) - Huet, Oppen - 1980
17 Proving theorems by pattern recognition (context) - Wang - 1960
17 From Frege to Godel: A Sourcebook of Mathematical Logic (context) - van Heijenoort - 1967
17 and Gregoire Sutre (context) - Henzinger, Jhala et al. - 2002
16 Predicate abstraction for software verification (context) - Flanagan, Qadeer - 2002
16 Deconstructing Shostak - Rue, Shankar - 2001
16 Toward mechanical mathematics (context) - Wang - 1960
15 ICS: Integrated Canonization and Solving (context) - Filliatre, Owre et al. - 2001
14 Stanford Pascal Verifier user manual (context) - Luckham, German et al. - 1979
13 volume 1427 of Lecture Notes in Computer Science (context) - Hu, Vardi et al. - 1998
13 A framework for cooperating decision procedures - Barrett, Dill et al. - 2000
10 STP: A mechanized logic for specification and verification (context) - Shostak, Schwartz et al. - 1982
8 Automation of Reasoning: Classical Papers on Computational L.. (context) - Siekmann, Wrightson - 1983
8 Steps toward artificial intelligence (context) - Minsky - 1963
8 Decision Procedures in Automated Deduction (context) - Tiwari - 2000
8 Empirical explorations with the logic theory machine: A case.. (context) - Newell, Shaw et al. - 1957
8 A proof method for quantification theory: Its justification .. (context) - Gilmore - 1983
6 The prehistory and early history of automated deduction (context) - Davis
6 Integrating Decision Procedures for Temporal Verification (context) - Bjrner - 1999
3 Solving numerical constraints (context) - Bockmayr, Weispfenning
3 Using decision procedures with a higher-order logic - Shankar - 2001
3 A computer program for Presburger's algorithm (context) - Davis - 1957
3 A certified version of Buchberger's algorithm (context) - Thery - 1998
3 Principles and pragmatics of subtyping in PVS - Shankar, Owre - 1999
2 Formal verification of a combination decision procedure - Ford, Shankar - 2002
1 Automated reasoning in geometry (context) - Chou, Gao
1 Reprinted in Siekmann and Wrightson [SW83 (context) - Prawitz, proof et al. - 1983
1 cient library for SAT: a manifesto (context) - Giunchiglia, Narizzano et al. - 2002
1 Mechanical mathematics and inferential analysis (context) - Wang - 1963
1 Reprinted in Siekmann and Wrightson [SW (context) - Davis, Logemann et al. - 1983
Documents on the same site (http://combination.cs.uiowa.edu/combination/papers.html): More
Path Rewriting and Combined Word Problems - Fiorentini, Ghilardi (2000) (Correct)
Deconstructing Shostak - Rueß, Shankar (2001) (Correct)
Combining Shostak Theories - Shankar, Rueß (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC