Sciweavers

442 search results - page 51 / 89
» Proof Abstraction for Imperative Languages
Sort
View
CLIMA
2004
13 years 10 months ago
Metareasoning for Multi-agent Epistemic Logics
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
Konstantine Arkoudas, Selmer Bringsjord
DAGSTUHL
2003
13 years 10 months ago
Organising Computation through Dynamic Grouping
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
Michael Fisher, Chiara Ghidini, Benjamin Hirsch
ICGI
2010
Springer
13 years 7 months ago
Grammatical Inference as Class Discrimination
Abstract. Grammatical inference is typically defined as the task of finding a compact representation of a language given a subset of sample sequences from that language. Many di...
Menno van Zaanen, Tanja Gaustad
ICFP
2009
ACM
14 years 9 months ago
Experience report: seL4: formally verifying a high-performance microkernel
We report on our experience using Haskell as an executable specification language in the formal verification of the seL4 microkernel. fication connects an abstract operational spe...
Gerwin Klein, Philip Derrin, Kevin Elphinstone
APLAS
2007
ACM
14 years 20 days ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous