Sciweavers

2661 search results - page 226 / 533
» A Semantics for Abstraction
Sort
View
ASWEC
2005
IEEE
16 years 9 days ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
DSVIS
2005
Springer
16 years 6 days ago
Mapping ConcurTaskTrees into UML 2.0
Abstract. The ConcurTaskTrees (CTT) is one of the most widely used notations for task modeling, specifically tailored for user interface model-based design. The integration of CTT ...
Leonel Nóbrega, Nuno Jardim Nunes, Helder C...
IJCAI
2007
15 years 8 months ago
A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks
argumentation frameworks have played a major role as a way of understanding argumentbased inference, resulting in different argumentbased semantics. In order to make such semantic...
Carlos Iván Chesñevar, Guillermo Ric...
DATE
2010
IEEE
146views Hardware» more  DATE 2010»
15 years 6 months ago
Automatic pipelining from transactional datapath specifications
Abstract—We present a transactional datapath specification (Tspec) and the tool (T-piper) to synthesize automatically an inpelined implementation from it. T-spec abstractly views...
Eriko Nurvitadhi, James C. Hoe, Timothy Kam, Shih-...
JLP
2011
106views more  JLP 2011»
14 years 9 months ago
Concurrent Kleene Algebra and its Foundations
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Tony Hoare, Bernhard Möller, Georg Struth, Ia...