Sciweavers

1076 search results - page 17 / 216
» Operations on proofs and labels
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 7 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
TCOM
2008
81views more  TCOM 2008»
13 years 7 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
CADE
2008
Springer
14 years 7 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
FM
1997
Springer
174views Formal Methods» more  FM 1997»
13 years 11 months ago
A Proof Obligation Generator for VDM-SL
In this paper an extension of the IFAD VDM-SL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type c...
Bernhard K. Aichernig, Peter Gorm Larsen
AGP
1995
IEEE
13 years 11 months ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...