496 search results - page 43 / 100 » A formal framework for synthesis and verification of logic p... |
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
SAS
2004
Springer
14 years 1 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
ASE
2010
13 years 7 months ago
2010
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
PPDP
2004
Springer
14 years 1 months ago
2004
Springer
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...