Sciweavers

1914 search results - page 261 / 383
» Verification by Abstract Interpretation
Sort
View
105
Voted
TAPSOFT
1997
Springer
15 years 4 months ago
Inclusion Constraints over Non-empty Sets of Trees
Abstract. We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 t2 between rst-order terms (without set operators) which are interpreted...
Martin Müller, Joachim Niehren, Andreas Podel...
102
Voted
ICPP
1993
IEEE
15 years 4 months ago
Meta-State Conversion
Abstract — In MIMD (Multiple Instruction stream, Multiple Data stream) execution, each processor has its own state. Although these states are generally considered to be independe...
Henry G. Dietz, G. Krishnamurthy
90
Voted
PEPM
1993
ACM
15 years 4 months ago
Partial Evaluation of General Parsers
Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) ...
Christian Mossin
PPCP
1993
15 years 4 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
80
Voted
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
15 years 4 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...