Sciweavers

3513 search results - page 614 / 703
» Super Logic Programs
Sort
View
90
Voted
LDTA
2010
15 years 22 days ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
86
Voted
ENTCS
2008
64views more  ENTCS 2008»
15 years 18 days ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader
121
Voted
ENTCS
2008
106views more  ENTCS 2008»
15 years 18 days ago
Verifying Test-Hypotheses: An Experiment in Test and Proof
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...
120
Voted
IJAIT
2006
106views more  IJAIT 2006»
15 years 16 days ago
An Empirical Evaluation of Automated Theorem Provers in Software Certification
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
Ewen Denney, Bernd Fischer 0002, Johann Schumann
102
Voted
JFP
2008
135views more  JFP 2008»
15 years 15 days ago
Hoare type theory, polymorphism and separation
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...