Sciweavers

1179 search results - page 102 / 236
» Programming in Hybrid Constraint Languages
Sort
View
APLAS
2011
ACM
14 years 1 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
ICSE
2007
IEEE-ACM
15 years 7 months ago
Languages for Safety-Critical Software: Issues and Assessment
Safety-critical systems (whose anomalous behavior could have catastrophic consequences such as loss of human life) are becoming increasingly prevalent; standards such as DO-178B, ...
Benjamin M. Brosgol
COLING
1996
15 years 2 months ago
Disambiguation of morphological analysis in Bantu languages
The paper describes problems in disambiguating the morphological analysis of Bantu languages by using Swahili as a test language. The main factors of ambiguity in this language gr...
Arvi Hurskainen
PLDI
1996
ACM
15 years 5 months ago
A Reduced Multipipeline Machine Description that Preserves Scheduling Constraints
High performance compilers increasingly rely on accurate modeling of the machine resources to efficiently exploit the instruction level parallelism of an application. In this pape...
Alexandre E. Eichenberger, Edward S. Davidson
CSL
2004
Springer
15 years 6 months ago
Set Constraints on Regular Terms
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
Pawel Rychlikowski, Tomasz Truderung