Sciweavers

5090 search results - page 119 / 1018
» Constructing Strategies for Programming
Sort
View
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
14 years 21 days ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas
VMCAI
2004
Springer
14 years 2 months ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
SCAM
2007
IEEE
14 years 3 months ago
Finding Inputs that Reach a Target Expression
We present an automated program analysis, called Reach, to compute program inputs that cause evaluation of explicitly-marked target expressions. Reach has a range of applications ...
Matthew Naylor, Colin Runciman
ANLP
1992
68views more  ANLP 1992»
13 years 10 months ago
Evaluating Parsing Strategies Using Standardized Parse Files
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...
Ralph Grishman, Catherine Macleod, John Sterling
CPAIOR
2006
Springer
14 years 27 days ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang