Sciweavers

4573 search results - page 466 / 915
» Automated Reasoning
Sort
View
LPAR
2012
Springer
14 years 1 months ago
Smart Testing of Functional Programs in Isabelle
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
Lukas Bulwahn
LICS
2012
IEEE
13 years 8 months ago
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
Naohiko Hoshino
LICS
2012
IEEE
13 years 8 months ago
Countermodels from Sequent Calculi in Multi-Modal Logics
—A novel countermodel-producing decision procedure that applies to several multi-modal logics, both intuitionistic and classical, is presented. Based on backwards search in label...
Deepak Garg, Valerio Genovese, Sara Negri
PLDI
2009
ACM
16 years 7 months ago
An integrated proof language for imperative programs
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
Karen Zee, Viktor Kuncak, Martin C. Rinard
150
Voted
FLOPS
2010
Springer
16 years 1 months ago
Automatically Generating Counterexamples to Naive Free Theorems
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
Daniel Seidel, Janis Voigtländer