Sciweavers

FROCOS
2005
Springer
14 years 5 months ago
Combination of Isabelle/HOL with Automatic Tools
We describe results and status of a sub project of the Verisoft [1] project. While the Verisoft project aims at verification of a complete computer system starting with hardware a...
Sergey Tverdyshev
FROCOS
2005
Springer
14 years 5 months ago
Hybrid CSP Solving
Eric Monfroy, Frédéric Saubion, Tony...
FROCOS
2005
Springer
14 years 5 months ago
Proving Liveness with Fairness Using Rewriting
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
Adam Koprowski, Hans Zantema
FROCOS
2005
Springer
14 years 5 months ago
Logical Analysis of Hash Functions
Abstract. In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducin...
Dejan Jovanovic, Predrag Janicic
FROCOS
2005
Springer
14 years 5 months ago
A Complete Temporal and Spatial Logic for Distributed Systems
Abstract. In this paper, we introduce a spatial and temporal logic for reasoning about distributed computation. The logic is a combination of an extension of hybrid logic, that all...
Dirk Pattinson, Bernhard Reus
FROCOS
2005
Springer
14 years 5 months ago
A Comprehensive Framework for Combined Decision Procedures
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
FROCOS
2005
Springer
14 years 5 months ago
A Concurrent Lambda Calculus with Futures
Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with f...
Joachim Niehren, Jan Schwinghammer, Gert Smolka
FROCOS
2005
Springer
14 years 5 months ago
ATS: A Language That Combines Programming with Theorem Proving
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
Sa Cui, Kevin Donnelly, Hongwei Xi
FROCOS
2005
Springer
14 years 5 months ago
Connecting Many-Sorted Structures and Theories Through Adjoint Functions
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
Franz Baader, Silvio Ghilardi