Sciweavers

2291 search results - page 251 / 459
» Logic Programming and Model Checking
Sort
View
122
Voted
CSL
2007
Springer
15 years 8 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
126
Voted
FPL
2007
Springer
176views Hardware» more  FPL 2007»
15 years 8 months ago
ReconOS: An RTOS supporting Hard- and Software Threads
Modern platform FPGAs integrate fine-grained reconfigurable logic with processor cores and allow the creation of complete configurable systems-on-chip. However, design methodol...
Enno Lübbers, Marco Platzner
115
Voted
CORR
2011
Springer
176views Education» more  CORR 2011»
14 years 9 months ago
Quantitative Synthesis for Concurrent Programs
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
103
Voted
DOCENG
2009
ACM
15 years 9 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
119
Voted
ISSTA
2004
ACM
15 years 8 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...