Sciweavers

551 search results - page 90 / 111
» Realizability of Real-Time Logics
Sort
View
JLP
2006
81views more  JLP 2006»
13 years 7 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
CSUR
1999
137views more  CSUR 1999»
13 years 7 months ago
Algebraic Methods for Specification and Formal Development of Programs
with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all it...
Donald Sannella, Andrzej Tarlecki
EUSFLAT
2009
134views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Flow Line Systems with Possibilistic Data: a System with Waiting Time in Line Uncertain
This paper proposes to analyze two flow line systems in which we include possibilistic data -the priority-discipline is possibilistic instead of probabilistic- and measure the perf...
David de la Fuente, María José Pardo
NFM
2011
306views Formal Methods» more  NFM 2011»
13 years 2 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
Rüdiger Ehlers
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
12 years 11 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...