3342 search results - page 267 / 669 » Automating Abstract Interpretation |
109
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...
116
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
162
Voted
CADE
2001
Springer
16 years 4 months ago
2001
Springer
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
142
Voted
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The FORCES project aims at providing robust and declarative formalisms for analyzing systems in the emerging areas of Security Protocols, Biological Systems and Multimedi...
157
Voted
TPHOL
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. This pearl examines how to verify functional programs written using the state monad. It uses Coq’s Program framework to provide strong specifications for the standard ...