Sciweavers

883 search results - page 83 / 177
» The Semantics of Verilog Using Transition System Combinators
Sort
View
IFM
2010
Springer
113views Formal Methods» more  IFM 2010»
13 years 7 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
ICSE
2009
IEEE-ACM
14 years 10 months ago
Analyzing critical process models through behavior model synthesis
Process models capture tasks performed by agents together with their control flow. Building and analyzing such models is important but difficult in certain areas such as safety-cr...
Christophe Damas, Bernard Lambeau, Francois Roucou...
CADE
2007
Springer
14 years 9 months ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt
CIKM
2010
Springer
13 years 7 months ago
Third workshop on exploiting semantic annotations in information retrieval (ESAIR): CIKM 2010 workshop
There is an increasing amount of structure on the Web as a result of modern Web languages, user tagging and annotation, and emerging robust NLP tools. These meaningful, semantic, ...
Jaap Kamps, Jussi Karlgren, Ralf Schenkel
CODES
2010
IEEE
13 years 7 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk