Sciweavers

411 search results - page 28 / 83
» Algebraic Imperative Specifications
Sort
View
TIT
2008
83views more  TIT 2008»
15 years 3 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
ICTAC
2010
Springer
15 years 1 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
MOC
2002
136views more  MOC 2002»
15 years 3 months ago
Automatic reduction of elliptic integrals using Carlson's relations
In a series of papers, B. C. Carlson produced tables of elliptic integrals, evaluating them in terms of easily computed symmetrical functions, using a group of multivariate recurre...
Norman Gray
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
15 years 7 months ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...
141
Voted
ETRICS
2006
15 years 7 months ago
Possibilistic Information Flow Control in MAKS and Action Refinement
Abstract. Formal methods emphasizes the need for a top-down approach when developing large reliable software systems. Refinements are map step by step abstract algebraic specificat...
Dieter Hutter