Sciweavers

3047 search results - page 480 / 610
» On the Meaning of Logical Completeness
Sort
View
HASKELL
2006
ACM
15 years 3 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
PPOPP
2006
ACM
15 years 3 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
ISQED
2005
IEEE
125views Hardware» more  ISQED 2005»
15 years 3 months ago
A New Method for Design of Robust Digital Circuits
As technology continues to scale beyond 100nm, there is a significant increase in performance uncertainty of CMOS logic due to process and environmental variations. Traditional c...
Dinesh Patil, Sunghee Yun, Seung-Jean Kim, Alvin C...
KBSE
2005
IEEE
15 years 3 months ago
A threat-driven approach to modeling and verifying secure software
This paper presents a formal approach to threat-driven modeling and verification of secure software using aspect-oriented Petri nets. Based on the behavior model of intended funct...
Dianxiang Xu, Kendall E. Nygard
SAC
2005
ACM
15 years 3 months ago
Identifying topological predicates for vague spatial objects
Many geographical applications deal with spatial objects that cannot be adequately described by determinate, crisp concepts because of their intrinsically indeterminate and vague ...
Alejandro Pauly, Markus Schneider