4340 search results - page 333 / 868 » Formal Methods and Cryptography |
190
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
This paper describes a method for formal compression of fuzzy systems. This method compresses a fuzzy system with an arbitrarily large number of rules into a smaller fuzzy system ...
179
click to vote
ASE
2002
15 years 6 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
112
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
A new theoretical development is presented for handling the over-segmentation problem in partitioning-based connected openings. The definition we propose treats singletons generat...
179
Voted
COMPSAC
2007
IEEE
16 years 1 months ago
2007
IEEE
Algebraic testing is an automated software testing method based on algebraic formal specifications. It has the advantages of highly automated testing process and independence of t...
147
click to vote
CAV
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We present an unfolding-based approach to LTL-X modelchecking of high-level Petri nets. It is based on the method proposed by Esparza and Heljanko for low-level nets [4, ...