3047 search results - page 291 / 610 » On the Meaning of Logical Completeness |
154
click to vote
PASTE
2004
ACM
16 years 1 months ago
2004
ACM
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
179
click to vote
AMAST
2004
Springer
16 years 1 months ago
2004
Springer
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
223
click to vote
RSCTC
2004
Springer
16 years 28 days ago
2004
Springer
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
194
click to vote
DALT
2003
Springer
16 years 24 days ago
2003
Springer
Abstract. This paper aims at defining the semantics of Agent Communication Languages (ACLs) in terms of changes in the social relationships between agents, represented in terms of...
170
click to vote
LICS
2002
IEEE
16 years 15 days ago
2002
IEEE
The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affi...