Sciweavers

3481 search results - page 394 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
16 years 1 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
CAISE
2004
Springer
15 years 10 months ago
Network-based Business Process Management: a Discussion on Embedding Business Logic in Communications Networks
Advanced Business Process Management (BPM) tools enable the decomposition of previously integrated and often ill-defined processes into reusable process modules. These process modu...
Louis-François Pau, Peter H. M. Vervest
TCAD
2008
101views more  TCAD 2008»
15 years 4 months ago
Using Field-Repairable Control Logic to Correct Design Errors in Microprocessors
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
ERSHOV
2009
Springer
15 years 8 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
PEPM
2011
ACM
14 years 7 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura