A preliminary English version appeared as Satoh, K. Nakagoshi, T. Katayama eds , Special Issue on Software Evolution, pp. Okamoto, H. Iwayama, N. Wakaki, T. A preliminary English version appeared as Wakaki, T. Satoh K. Van der Torre, L. Lecture Notes in Computer Science , pp. A preliminary version appeared as Van der Torre, L. Novais, P. Silva, A.
NalepaJoachim Baumeister Eds. Arisaka, R. Kurahashi et al. A preliminary version appeared as Arisaka, R. Shams, Z. A preliminary version appeared as Shams, Z. Athakravi, D. Kim, M-Y. Nakano, K. Satoh, D. Bekki Eds. A preliminary version appeared as Kim, M-Y. Tanaka, N. Spyratos, T.
Yoshida, C. Meghini Eds. De Vos, M. Motomura, A. Bulter, D. A preliminary version appeared as De Vos, M. Li, T. A preliminary version appeared as Li, T. Baldoni, L. Dennis, V. Mascardi, W Vasconcelos Eds. A preliminary version appeared as Athakravi, D. Nakakoji, Y.
SSN College of Engineering
Murakami, E. McCready eds. Hickey, Q.
Ju, and M. Holzbaur: Meta-structures Vs. Jaffar, S.
International Congresses on Logic, Methodology and Philosophy of Science
Michaylov, P. Stuckey and R. Jaffar and M. Kearfott and V. Kreinovich: Applications of Interval Computations , Kluwer, AI Magazine , 13 1 , pp.
- Pattern-oriented software architecture, vol.4: patterns for distributed computing.
- The Pop-Up Book: Step-by-Step Instructions for Creating Over 100 Original Paper Projects!
- The Tinkertoy Computer and Other Machinations: Computer Recreations from the Pages of Scientific American and Algorithm?
- Stable Radicals: Fundamentals and Applied Aspects of Odd-Electron Compounds.
- Articles in Refereed Journals.
- Articles in Refereed Journals.
- Modeling and Optimization for Mobile Social Networks.
M Lee and T. Pacholski and A. Puget and M. International Logic Programming Symposium , pp.
Puget: Finite Set Intervals, in Proc. Surveys , vol. CrossRef Google Scholar.
Zhou and J. Personalised recommendations. Cite paper How to cite? Tree automata-based refinement with application to Horn clause verification. Constraint Specialisation in Horn Clause Verification. On Reducing Linearizability to State Reachability.
Articles in Refereed Conferences
Monitoring Refinement via Symbolic Reasoning. Proceedings, pages , Tractable Refinement Checking for Concurrent Objects. Carolina Dania , Manuel Clavel. From Non-Zenoness Verification to Termination.
Verification of Population Protocols. CAV ' Proc. Ganty, Pierre , Iosif, Radu. Interprocedural Reachability for Flat Integer Programs. FCT ' Proc. Ratan Lal, Pavithra Prabhakar.
- The Magic Kingdom of Landover, Volume 1.
- Months and Seasons.
- Coalgebraic semantics for derivations in logic programming.
Bounded error flowpipe computation of parameterized linear systems. Analyzing Program Analyses. System-level Non-interference for Constant-time Cryptography. Synthesis of Fault Attacks on Cryptographic Implementations. Dragan Ivanovic , Manuel Carro. Joseph A. Certified Synthesis of Efficient Batch Verifiers. Proving differential privacy in Hoare logic. Safety of live transactions in transactional memory: TMS is necessary and sufficient. Parameterised linearisability.
Replicated data types: specification, verification, optimality. Deriving interpretations of the gradually-typed lambda calculus. Cerone, Andrea , Hennessy, Matthew. Trustworthy Global Computing, pages , Springer, Mitchell, Andre Scedrov, Benedikt Schmidt. Probabilistic relational verification for cryptographic implementations. Leakage Resilience against Concurrent Cache Attacks. Parametrized Verification Diagrams. LNCS, Vol. Michael R. Micinski, Markus N. Temporal Logics for Hyperproperties. Liqat , S.