Sciweavers

1901 search results - page 255 / 381
» Predicting Program Properties from
Sort
View
CAISE
2005
Springer
15 years 8 months ago
The Association Construct in Conceptual Modelling - An Analysis Using the Bunge Ontological Model
Associations are a widely used construct of object-oriented languages. However, the meaning of associations for conceptual modelling of application domains remains unclear. This pa...
Joerg Evermann
IFIP
2005
Springer
15 years 8 months ago
Opacity Generalised to Transition Systems
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of...
Jeremy Bryans, Maciej Koutny, Laurent Mazaré...
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
15 years 8 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
FOSSACS
2004
Springer
15 years 8 months ago
Strong Bisimulation for the Explicit Fusion Calculus
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
Lucian Wischik, Philippa Gardner
IFIP
2004
Springer
15 years 8 months ago
A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
An Braeken, Christopher Wolf, Bart Preneel