Sciweavers

12774 search results - page 123 / 2555
» A Framework for Proof Systems
Sort
View
TELSYS
2002
126views more  TELSYS 2002»
15 years 3 months ago
Framework and Tool Support for Formal Verification of Highspeed Transfer Protocol Designs
Formal description techniques, verification methods, and their tool-based automated application meanwhile provide valuable support for the formal analysis of communication protocol...
Peter Herrmann, Heiko Krumm, Olaf Drögehorn, ...
147
Voted
TPHOL
2008
IEEE
15 years 10 months ago
Imperative Functional Programming with Isabelle/HOL
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
Lukas Bulwahn, Alexander Krauss, Florian Haftmann,...
ESOP
2004
Springer
15 years 9 months ago
Extracting a Data Flow Analyser in Constructive Logic
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
David Cachera, Thomas P. Jensen, David Pichardie, ...
ECCC
2007
90views more  ECCC 2007»
15 years 4 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
COMMA
2006
15 years 5 months ago
The Carneades Argumentation Framework - Using Presumptions and Exceptions to Model Critical Questions
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...
Thomas F. Gordon, Douglas Walton