Sciweavers

202 search results - page 37 / 41
» Proof Search in Minimal Logic
Sort
View
TAPSOFT
1997
Springer
13 years 11 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
CORR
2011
Springer
140views Education» more  CORR 2011»
12 years 11 months ago
A Wiki for Business Rules in Open Vocabulary, Executable English
The problem of business-IT alignment is of widespread economic concern. As one way of addressing the problem, this paper describes an online system that functions as a kind of Wik...
Adrian Walker
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&...
SPIN
2009
Springer
14 years 2 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh
ICTAC
2009
Springer
13 years 5 months ago
Integration Testing from Structured First-Order Specifications via Deduction Modulo
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
Delphine Longuet, Marc Aiguier