Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Automated Deduction - CADE-15: 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings > System description: Verification of distributed Erlang programs
Automated Deduction - CADE-15: 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings |
Claude Kirchner; Hélène Kirchner
Springer Berlin Heidelberg
Automated Deduction - CADE-15: 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings
System description: Verification of distributed Erlang programs
Authors

Thomas Arts; Mads Dam; Lars -åke Fredlund; Dilian Gurov

ARI Id

1674219719879_2863706

Access

Open/Free Access

Pages

38-41

DOI

10.1007/BFb0054244

Chapter URL

https://rd.springer.com/chapter/10.1007/BFb0054244

Table of Contents of Book
Showing 1 to 20 of 39 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Reasoning about deductions in linear logic
Frank Pfenning
1-2
A combination of nonstandard analysis and geometry theorem proving, with application to Newton's Principia
Jacques D. Fleuriot; Lawrence C. Paulson
3-16
Proving geometric theorems using clifford algebra and rewrite rules
Stéphane Fèvre; Dongming Wang
17-32
System description: similarity-based lemma generation for model elimination
Marc Fuchs
33-37
System description: Verification of distributed Erlang programs
Thomas Arts; Mads Dam; Lars -åke Fredlund; Dilian Gurov
38-41
System description: Cooperation in model elimination: CPTHEO
Marc Fuchs; Andreas Wolf
42-46
System description: CardTAP: The first theorem prover on a smart card
Rajeev Goré; Joachim Posegga; Andrew Slater; Harald Vogt
47-50
System description: leanK 2. 0
Bernhard Beckert; Rajeev Goré
51-55
Extensional higher-order resolution
Christoph Benzmüller; Michael Kohlhase
56-71
X. R. S: Explicit reduction systems — A first-order calculus for higher-order calculi
Bruno Pagano
72-87
About the confluence of equational pattern rewrite systems
Alexandre Boudet; Evelyne Contejean
88-102
Unification in lambda-calculi with if-then-else
Michael Beeson
103-118
System description: An equational constraints solver
Nicolas Peltier
119-123
System description: CRIL platform for SAT
Bertrand Mazure; Lakhdar SaÏs; éric Grégoire
124-128
System description: Proof planning in higher-order logic with λClam
Julian Richardson; Alan Smaill; Ian Green
129-133
System description: An interface between CLAM and HOL
Konrad Slind; Mike Gordon; Richard Boulton; Alan Bundy
134-138
System description: Leo — A higher-order theorem prover
Christoph Benzmüller; Michael Kohlhase
139-143
Superposition for divisible torsion-free abelian groups
Uwe Waldmann
144-159
Strict basic superposition
Leo Bachmair; Harald Ganzinger
160-174
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 39 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings