Sciweavers

221 search results - page 33 / 45
» Heyting Algebras and Formal Languages
Sort
View
ROOM
2000
13 years 11 months ago
Checking the Consistency of UML Class Diagrams Using Larch Prover
The Unified Modeling Language (UML) has been designed to be a full standard notation for Object-Oriented Modelling. UML is a rather complete set of notations, but it lacks of form...
Pascal André, Annya Romanczuk, Jean-Claude ...
ECOOP
2007
Springer
14 years 1 months ago
Tracking Linear and Affine Resources with Java(X)
Java(X) is a framework for type refinement. It extends Java's type language with annotations drawn from an algebra X and structural subtyping in terms of the annotations. Each...
Markus Degen, Peter Thiemann, Stefan Wehr
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 9 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
WOSP
2004
ACM
14 years 3 months ago
Software performance modelling using PEPA nets
Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets—coloured stochastic Petri nets—are a recently introduced modelling formalism w...
Stephen Gilmore, Jane Hillston, Leïla Kloul, ...
IFM
2010
Springer
113views Formal Methods» more  IFM 2010»
13 years 8 months ago
Translating Pi-Calculus into LOTOS NT
Process calculi supporting mobile communication, such as the π-calculus, are often seen as an evolution of classical value-passing calculi, in which communication between processe...
Radu Mateescu, Gwen Salaün