391 search results - page 21 / 79 » Formal Universes |
99
Voted
SAS
2010
Springer
14 years 10 months ago
2010
Springer
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
100
click to vote
SAS
2004
Springer
15 years 5 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
CCS
2009
ACM
15 years 7 months ago
2009
ACM
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
144
click to vote
FROCOS
2009
Springer
15 years 7 months ago
2009
Springer
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...
79
Voted
ICSM
1999
IEEE
15 years 4 months ago
1999
IEEE
The FermaT transformation system, based on research carried out over the last twelve years at Durham University and Software Migrations Ltd., is an industrial-strength formal tran...