Sciweavers

227 search results - page 45 / 46
» P Systems and Finite Automata
Sort
View
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
BIRTHDAY
2010
Springer
14 years 2 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
14 years 2 months ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo
ICSE
2001
IEEE-ACM
14 years 2 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris
AIED
2009
Springer
14 years 4 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan