Sciweavers

3653 search results - page 379 / 731
» On Recognizable Timed Languages
Sort
View
PDP
2009
IEEE
16 years 1 months ago
Two Formal Semantics of a Subset of the Paderborn University BSPlib
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
Frédéric Gava, Jean Fortin
ERSHOV
2009
Springer
16 years 1 months ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
Laura Kovács
ICLA
2009
Springer
16 years 1 months ago
From Philosophical to Industrial Logics
One of the surprising developments in the area of program verification is how ideas introduced by logicians in the early part of the 20th Century ended up yielding by the 21 Centu...
Moshe Y. Vardi
SCCC
2008
IEEE
16 years 1 months ago
Hardware Synthesis for Asynchronous Communications Mechanisms
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In this work an automatic meth...
Kyller Costa Gorgônio, Jordi Cortadella
ECTEL
2007
Springer
16 years 28 days ago
Integration in Generic Tool Learning Design to Support Complex Learning Methodologies
: Current learning modelling languages do not allow formalization of scripts where generic tools are required. This limitation is especially relevant on remote courses when using c...
Luis de la Fuente Valentín