Sciweavers

5255 search results - page 439 / 1051
» Formal Methods for Privacy
Sort
View
FM
1997
Springer
159views Formal Methods» more  FM 1997»
15 years 11 months ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
15 years 11 months ago
Exact Flow Analysis
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Christian Mossin
FM
1994
Springer
113views Formal Methods» more  FM 1994»
15 years 11 months ago
Abstract Model Checking of Infinite Specifications
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
Daniel Jackson
AGTIVE
2007
Springer
15 years 11 months ago
Shaped Generic Graph Transformation
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
FORMATS
2009
Springer
15 years 10 months ago
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
Peter Bulychev, Thomas Chatain, Alexandre David, K...