Sciweavers

131 search results - page 15 / 27
» Abstract Counterexamples for Non-disjunctive Abstractions
Sort
View
LPNMR
2005
Springer
14 years 27 days ago
SELP - A System for Studying Strong Equivalence Between Logic Programs
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
Yin Chen, Fangzhen Lin, Lei Li
ASIACRYPT
1999
Springer
13 years 11 months ago
Linear Complexity versus Pseudorandomness: On Beth and Dai's Result
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
Yongge Wang
IPL
2007
94views more  IPL 2007»
13 years 7 months ago
A note on the Hadwiger number of circular arc graphs
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...
JPDC
2010
117views more  JPDC 2010»
13 years 5 months ago
Extensible transactional memory testbed
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
Derin Harmanci, Vincent Gramoli, Pascal Felber, Ch...
ACSD
2010
IEEE
222views Hardware» more  ACSD 2010»
13 years 5 months ago
Efficient Model Checking of PSL Safety Properties
Abstract--Safety properties are an important class of properties as in the industrial use of model checking a large majority of the properties to be checked are safety properties. ...
Tuomas Launiainen, Keijo Heljanko, Tommi A. Juntti...