827 search results - page 110 / 166 » Proof-Theoretic Soundness and Completeness |
108
Voted
ICRE
2000
IEEE
15 years 5 months ago
2000
IEEE
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
81
Voted
APAL
2010
15 years 26 days ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
134
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
123
click to vote
CADE
2005
Springer
16 years 1 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
106
Voted
ICFP
2002
ACM
16 years 21 days ago
2002
ACM
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...