Sciweavers

3771 search results - page 656 / 755
» Subobject Transformation Systems
Sort
View
FASE
2008
Springer
15 years 4 months ago
Language-Based Optimisation of Sensor-Driven Distributed Computing Applications
In many distributed computing paradigms, especially sensor networks and ubiquitous computing but also grid computing and web services, programmers commonly tie their application to...
Jonathan J. Davies, Alastair R. Beresford, Alan My...
FASE
2008
Springer
15 years 4 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
139
Voted
FM
2008
Springer
192views Formal Methods» more  FM 2008»
15 years 4 months ago
CoVaC: Compiler Validation by Program Analysis of the Cross-Product
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compiler...
Anna Zaks, Amir Pnueli
FM
2008
Springer
75views Formal Methods» more  FM 2008»
15 years 4 months ago
Masking Faults While Providing Bounded-Time Phased Recovery
We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
129
Voted
AGI
2008
15 years 4 months ago
Probabilistic Quantifier Logic for General Intelligence: An Indefinite Probabilities Approach
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...
Matthew Iklé, Ben Goertzel