Sciweavers

423 search results - page 22 / 85
» On Term Rewriting Systems Having a Rational Derivation
Sort
View
94
Voted
SOFSEM
2009
Springer
15 years 9 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
114
Voted
SCOPES
2004
Springer
15 years 6 months ago
An Automated C++ Code and Data Partitioning Framework for Data Management of Data-Intensive Applications
An automated framework for code and data partitioning for the needs of data management is presented. The goal is to identify the main data types from the data management perspectiv...
Athanasios Milidonis, Grigoris Dimitroulakos, Mich...
95
Voted
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 24 days ago
On characterising strong bisimilarity in a fragment of CCS with replication
We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The ch...
Daniel Hirschkoff, Damien Pous
ENTCS
2006
146views more  ENTCS 2006»
15 years 21 days ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
CSUR
1999
114views more  CSUR 1999»
15 years 11 days ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot