Sciweavers

4513 search results - page 272 / 903
» Logic programming with satisfiability
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 4 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell
TASE
2007
IEEE
15 years 10 months ago
Design of a Certifying Compiler Supporting Proof of Program Safety
Safety is an important property of high-assurance software, and one of the hot research topics on it is the verification method for software to meet its safety policies. In our p...
Yiyun Chen, Lin Ge, Baojian Hua, Zhaopeng Li, Chen...
114
Voted
FSS
2008
143views more  FSS 2008»
15 years 4 months ago
On the first place antitonicity in QL-implications
In order to obtain a demanded fuzzy implication, a number of properties have been proposed, among which the first place antitonicity, the second place monotonicity and the boundar...
Yun Shi, Bart Van Gasse, Da Ruan, Etienne E. Kerre
MKM
2009
Springer
15 years 10 months ago
Combining Coq and Gappa for Certifying Floating-Point Programs
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
Sylvie Boldo, Jean-Christophe Filliâtre, Gui...
135
Voted
AHS
2007
IEEE
263views Hardware» more  AHS 2007»
15 years 10 months ago
Programming an FPGA-based Super Computer Using a C-to-VHDL Compiler: DIME-C
Since their invention in the 1980s, the logic density of FPGAs has increased exponentially with time. This increase of logic density first led to the development of synthesisable ...
Gildas Genest, Richard Chamberlain, Robin J. Bruce