Sciweavers

143 search results - page 23 / 29
» Fixed-Parameter Complexity of Semantics for Logic Programs
Sort
View
TASE
2008
IEEE
15 years 3 months ago
PDL over Accelerated Labeled Transition Systems
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
Taolue Chen, Jaco van de Pol, Yanjing Wang
PLDI
2010
ACM
15 years 2 months ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn
KBSE
2007
IEEE
15 years 3 months ago
Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
Kobi Inkumsah, Tao Xie
JELIA
2010
Springer
14 years 7 months ago
Tabling with Answer Subsumption: Implementation, Applications and Performance
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
Terrance Swift, David Scott Warren
WWW
2002
ACM
15 years 10 months ago
Simulation, verification and automated composition of web services
Web services -- Web-accessible programs and devices ? are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semanti...
Srini Narayanan, Sheila A. McIlraith