Sciweavers

442 search results - page 27 / 89
» Proof Abstraction for Imperative Languages
Sort
View
ICFEM
2003
Springer
14 years 1 months ago
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
14 years 2 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
ESOP
2004
Springer
14 years 2 months ago
Linear Types for Packet Processing
Abstract. We present PacLang: an imperative, concurrent, linearlytyped language designed for expressing packet processing applications. PacLang’s linear type system ensures that ...
Robert Ennals, Richard Sharp, Alan Mycroft
ICALP
2005
Springer
14 years 2 months ago
Single-Key AIL-MACs from Any FIL-MAC
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
Ueli M. Maurer, Johan Sjödin
DIAGRAMS
2010
Springer
13 years 9 months ago
Heterogeneous Reasoning in Real Arithmetic
Abstract. Diagrams often complement sentential proofs in mathematics. However, diagrams are rarely used as standalone reasoning tools. Thus we propose to integrate diagrammatic rea...
Matej Urbas, Mateja Jamnik