4480 search results - page 133 / 896 » Prototyping Completion with Constraints Using Computational ... |
166
click to vote
MKM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
168
click to vote
AICOM
2004
15 years 6 months ago
2004
The paper abstracts the contents of a PhD dissertation entitled A Generic, Collaborative Framework for Interval Constraint Solving which has been recently defended. This thesis pre...
162
click to vote
SOFSEM
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
171
click to vote
HASE
2005
IEEE
15 years 12 months ago
2005
IEEE
We propose an approach to analyse the safety of avionic systems that takes into account the impact of computation and communication resource sharing. The approach is made of three...
188
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...