Sciweavers

3457 search results - page 65 / 692
» A Symbol Is Not a Symbol
Sort
View
COLING
1992
13 years 11 months ago
A Treatment Of Negative Descriptions Of Typed Feature Structures
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
Kiyoshi Kogure
FCSC
2008
133views more  FCSC 2008»
13 years 10 months ago
Computational origami environment on the web
We present a computing environment for origami on the web. The environment consists of the computational origami engine Eos for origami construction, visualization, and geometrical...
Asem Kasem, Tetsuo Ida
AISC
2006
Springer
14 years 2 months ago
Hierarchical Representations with Signatures for Large Expression Management
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
Wenqin Zhou, Jacques Carette, David J. Jeffrey, Mi...
ATVA
2011
Springer
240views Hardware» more  ATVA 2011»
12 years 10 months ago
Self-Loop Aggregation Product - A New Hybrid Approach to On-the-Fly LTL Model Checking
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. T...
Alexandre Duret-Lutz, Kais Klai, Denis Poitrenaud,...
FMCAD
2006
Springer
14 years 1 months ago
Over-Approximating Boolean Programs with Unbounded Thread Creation
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Byron Cook, Daniel Kroening, Natasha Sharygina