1536 search results - page 163 / 308 » The Underlying Logic of Hoare Logic |
166
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
180
click to vote
SFM
2007
Springer
16 years 18 days ago
2007
Springer
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...
171
click to vote
TIME
2006
IEEE
16 years 15 days ago
2006
IEEE
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
170
click to vote
GLVLSI
2005
IEEE
16 years 3 days ago
2005
IEEE
Switching model captures the data-driven uncertainty in logic circuits in a comprehensive probabilistic framework. Switching is a critical factor that influences dynamic, active ...
155
click to vote
ASP
2005
Springer
16 years 1 days ago
2005
Springer
In this paper we consider an extension of the answer set semantics allowing arbitrary use of strong negation. We prove that the strong negation extension of any intermediate logic ...