446 search results - page 87 / 90 » A Theorem Prover for a Computational Logic |
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
KBSE
2000
IEEE
13 years 11 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
PLDI
2009
ACM
14 years 1 days ago
2009
ACM
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...