4126 search results - page 378 / 826 » Set based logic programming |
133
click to vote
FCT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
139
click to vote
ASE
2010
15 years 4 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...
143
click to vote
APWEB
2006
Springer
15 years 8 months ago
2006
Springer
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...
176
click to vote
TRIER
2002
15 years 4 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
143
Voted
PPDP
2009
Springer
15 years 11 months ago
2009
Springer
This paper describes the design goals and current status of tidier, a software tool that tidies Erlang source code, making it cleaner, simpler, and often also more efficient. In ...