Sciweavers

855 search results - page 84 / 171
» Using First-Order Logic to Reason about Policies
Sort
View
SIGCSE
2000
ACM
453views Education» more  SIGCSE 2000»
14 years 1 months ago
Aristotle and object-oriented programming: why modern students need traditional logic
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
Derek Rayside, Gerard T. Campbell
FOSSACS
2005
Springer
14 years 2 months ago
Duality for Logics of Transition Systems
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
Marcello M. Bonsangue, Alexander Kurz
CL
2000
Springer
14 years 1 months ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
KBSE
2010
IEEE
13 years 7 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
CSL
2004
Springer
14 years 2 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...