Sciweavers

491 search results - page 63 / 99
» An Interpolating Theorem Prover
Sort
View
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
14 years 3 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
ESOP
2009
Springer
14 years 3 months ago
Well-Typed Programs Can't Be Blamed
We show how contracts with blame fit naturally with recent work on hybrid types and gradual types. Unlike hybrid types or gradual types, we require casts in the source code, in o...
Philip Wadler, Robert Bruce Findler
FASE
2009
Springer
14 years 3 months ago
A Formal Connection between Security Automata and JML Annotations
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
Marieke Huisman, Alejandro Tamalet
TASE
2009
IEEE
14 years 3 months ago
Semantics of Metamodels in UML
A modelling language can be defined by a metamodel in UML class diagram. This paper defines the semantics of such metamodels through two mappings: a signature mapping from metamod...
Lijun Shan, Hong Zhu
ICFEM
2009
Springer
14 years 3 months ago
A Lazy Unbounded Model Checker for Event-B
Formal specification languages are traditionally supported by theorem provers, but recently model checkers have proven to be useful tools. In this paper we present Eboc, an explic...
Paulo J. Matos, Bernd Fischer, João P. Marq...