Sciweavers

1073 search results - page 47 / 215
» Formal Program Development with Approximations
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 23 days ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ICALP
2007
Springer
14 years 2 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
SAS
2000
Springer
14 years 8 days ago
Flattening Is an Improvement
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
James Riely, Jan Prins
COMPUTER
2006
87views more  COMPUTER 2006»
13 years 8 months ago
What Can We Expect from Program Verification?
The role of intuition in software development was discussed in a most original fashion by Peter Naur in 1984. Yet there has been little subsequent interest in elaborating on Naur&#...
Michael Jackson
JMLR
2012
11 years 11 months ago
Approximate Inference in Additive Factorial HMMs with Application to Energy Disaggregation
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
J. Zico Kolter, Tommi Jaakkola