605 search results - page 100 / 121 » Dealing with logical omniscience |
148
click to vote
TAPSOFT
1997
Springer
15 years 9 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
176
click to vote
ICSE
1993
IEEE-ACM
15 years 9 months ago
1993
IEEE-ACM
We give examples of situations where formal specifications of procedures in the standard pre/postcondition style become lengthy, cumbersome and difficult to change, a problem whic...
133
click to vote
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
167
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
144
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Supporting Distributed Shared Memory (DSM) is essential for multi-core Network-on-Chips for the sake of reusing huge amount of legacy code and easy programmability. We p...