Result 1 to 20 of 123 total
A note on "on the construction of Boolean functions with optimal algebraic immunity" (English)
IEICE Transactions 94-A, No. 9, 1877-1880 (2011).
1
A combination of forward and backward reachability analysis methods. (English)
Dong, Jin Song (ed.) et al., Formal methods and software engineering. 12th international conference on formal engineering methods, ICFEM 2010, Shanghai, China, November 17‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16900-7/pbk). Lecture Notes in Computer Science 6447, 501-517 (2010).
2
Fostering proof scores in CafeOBJ. (English)
Dong, Jin Song (ed.) et al., Formal methods and software engineering. 12th international conference on formal engineering methods, ICFEM 2010, Shanghai, China, November 17‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16900-7/pbk). Lecture Notes in Computer Science 6447, 1-20 (2010).
3
A generic binary analysis method for malware. (English)
Echizen, Isao (ed.) et al., Advances in information and computer security. 5th international workshop on security, IWSEC 2010, Kobe, Japan, November 22‒24, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16824-6/pbk). Lecture Notes in Computer Science 6434, 199-216 (2010).
4
Proof score approach to analysis of electronic commerce protocols. (English)
Int. J. Softw. Eng. Knowl. Eng. 20, No. 2, 253-287 (2010).
5
Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications. (English)
J. Symb. Comput. 45, No. 5, 551-573 (2010).
6
Towards reliable E-government systems with the OTS/cafeobj method (English)
IEICE Transactions 93-D, No. 5, 974-984 (2010).
7
Fostering proof scores in cafeobj (English)
ICFEM, 1-20 (2010).
8
A combination of forward and backward reachability analysis methods (English)
ICFEM, 501-517 (2010).
9
A generic binary analysis method for malware (English)
IWSEC, 199-216 (2010).
10
Constructor-based institutions. (English)
Kurz, Alexander (ed.) et al., Algebra and coalgebra in computer science. Third international conference, CALCO 2009, Udine, Italy, September 7‒10, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03740-5/pbk). Lecture Notes in Computer Science 5728, 398-412 (2009).
11
User-defined on-demand matching (English)
IEICE Transactions 92-D, No. 7, 1401-1411 (2009).
12
Constructor-based institutions (English)
CALCO, 398-412 (2009).
13
Simulation-based verification for invariant properties in the OTS/CafeOBJ method. (English)
Electron. Notes Theor. Comput. Sci. 201, 127-154 (2008).
14
Formal analysis of the bakery protocol with consideration of nonatomic reads and writes. (English)
Liu, Shaoying (ed.) et al., Formal methods and software engineering. 10th international conference on formal engineering methods, ICFEM 2008, Kitakyushu-City, Japan, October 27‒31, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-88193-3/pbk). Lecture Notes in Computer Science 5256, 187-206 (2008).
15
Verifying design with proof scores. (English)
Meyer, Bertrand (ed.) et al., Verified software: Theories, tools, experiments. First IFIP TC 2/WG 2.3 conference, VSTTE 2005, Zurich, Switzerland, October 10‒13, 2005. Revised selected papers and discussions. Berlin: Springer (ISBN 978-3-540-69147-1/pbk). Lecture Notes in Computer Science 4171, 277-290 (2008).
16
A specification translation from behavioral specifications to rewrite specifications (English)
IEICE Transactions 91-D, No. 5, 1492-1503 (2008).
17
Proof score approach to verification of liveness properties (English)
IEICE Transactions 91-D, No. 12, 2804-2817 (2008).
18
Formal analysis of the bakery protocol with consideration of nonatomic reads and writes (English)
ICFEM, 187-206 (2008).
19
Formal digital license language with OTS/cafeobj method (English)
AICCSA, 652-660 (2008).
20
Result 1 to 20 of 123 total
Start
Contact
Print
General Help
