Lawrence Paulson | 22 Oct 13:33 2014

MetiTarski 2.4 released!

MetiTarski is an automatic theorem prover based on a combination of resolution and computer algebra
technology. It is designed to prove theorems involving real-valued special functions such as ln, exp,
sin, cos, arctan and sqrt. All variables are assumed to range over the real numbers.

MetiTarski can be downloaded from

You will be asked to leave your name and e-mail address so that we can have an idea how many users there are. You
will not receive regular e-mails from us.

Version 2.4 includes improved documentation, the nth-root function and experimental support for Bessel
functions of the first kind. We have added over 30,000 problems arising from William Denman's Ph.D. research.

We continue to provide a binary distribution (64-bit Linux and OSX).

Please note that MetiTarski is experimental research software. Feedback is welcome!!

Larry Paulson
S B Cooper | 22 Oct 22:42 2014

CiE 2015: Evolving Computability, Bucharest, June 29 - July 3, 2015

      COMPUTABILITY IN EUROPE 2015: Evolving Computability
                   Bucharest, Romania
                    June 29 - July 3


Submission Deadline for LNCS:                 11 January 2015
Notification of authors:                         9 March 2015
Deadline for final revisions:                    6 April 2015

CiE 2015 is the 11th conference organized by CiE (Computability
in Europe), a European association of mathematicians, logicians,
computer scientists, philosophers, physicists and others
interested in new developments in computability and their
underlying significance for the real world. Previous meetings
have taken place in Amsterdam (2005), Swansea (2006), Siena
(2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010),
Sofia (2011), Cambridge (2012), Milan (2013) and Budapest (2014).

Evolution of the universe, and us within it, invite a parallel
evolution in understanding. The CiE agenda - fundamental and
engaged - targets the extracting and developing of computational
models basic to current challenges.  From the origins of life, to
the understanding of human mentality, to the characterising of
quantum randomness - computability theoretic questions arise in
many guises.  The CiE community, this coming year meeting for the
first time in Bucharest, carries forward the search for
coherence, depth and new thinking across this rich and vital
(Continue reading)

S B Cooper | 22 Oct 22:42 2014

CiE 2015: Evolving Computability, Bucharest, June 29 - July 3, 2015

      COMPUTABILITY IN EUROPE 2015: Evolving Computability
                   Bucharest, Romania
                    June 29 - July 3


Submission Deadline for LNCS:                 11 January 2015
Notification of authors:                         9 March 2015
Deadline for final revisions:                    6 April 2015

CiE 2015 is the 11th conference organized by CiE (Computability
in Europe), a European association of mathematicians, logicians,
computer scientists, philosophers, physicists and others
interested in new developments in computability and their
underlying significance for the real world. Previous meetings
have taken place in Amsterdam (2005), Swansea (2006), Siena
(2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010),
Sofia (2011), Cambridge (2012), Milan (2013) and Budapest (2014).

Evolution of the universe, and us within it, invite a parallel
evolution in understanding. The CiE agenda - fundamental and
engaged - targets the extracting and developing of computational
models basic to current challenges.  From the origins of life, to
the understanding of human mentality, to the characterising of
quantum randomness - computability theoretic questions arise in
many guises.  The CiE community, this coming year meeting for the
first time in Bucharest, carries forward the search for
coherence, depth and new thinking across this rich and vital
(Continue reading)

Liu Yang (Asst Prof | 17 Oct 11:45 2014

ICFEM 2014, Luxembourg, 3-7 November 2014: Last Call for Participation

16th International Conference on Formal Engineering Methods
ICFEM 2014, Luxembourg, 3-7 November 2014

Last Call for Participation
The 16th International Conference on Formal Engineering Methods (ICFEM
2014) will be held at the Melia Hotel in Luxembourg, Luxembourg from
3rd November to 7 November 2014. Since 1997, ICFEM has been serving as
an international forum for researchers and practitioners who have been
seriously applying formal methods to practical applications.

+ Keynote speakers: Nikolaj Bjorner (Microsoft Research), Lionel
Briand (University of Luxembourg) and Vincent Danos (University of
+ The conference is now available
+ Panel discussion on November 4th: Are Formal Engineering Methods and Agile Methods Friend or Enemy?
+ Two affiliated workshops FTSCS 2014 and SOFL+MSVL.

PC Chairs
+ Stephan Merz (INRIA, France)
+ Jun Pang (University of Luxembourg, Luxembourg)
CONFIDENTIALITY: This email is intended solely for the person(s) named and may be confidential and/or
privileged. If you are not the intended recipient, please delete it, notify us and do not copy, use, or
disclose its contents.
(Continue reading)

Michael Winter | 20 Oct 21:19 2014

CFP: Relational and Algebraic Methods in Computer Science (RAMiCS 2015)

                           CALL FOR PAPERS

                  15th International Conference on
    Relational and Algebraic Methods in Computer Science (RAMiCS 2015)

            28 September to 1 October 2015, Braga, Portugal


 We invite submissions in the general area of Relational and Algebraic 
 Methods  in Computer Science. Special focus will lie on formal methods 
 for software engineering, logics of programs and links with neighbouring 

 Particular topics of interest for the conference cover,
 but are not limited to:

 * Algebraic approaches to
   - specification, development, verification, and analysis of programs
     and algorithms
   - computational logic, in particular logics of programs, modal and
     dynamic logics, interval and temporal logics
   - semantics of programming languages

(Continue reading)

COMPAGNA, Luca | 16 Oct 17:19 2014

[CfP] ESSOS 2015: demo session - deadline: Oct 24th

[Apologies for multiple copies of this announcement]


This year we are planning to include a demonstration session in the ESSOS symposium. If you are working on practical solutions to industrial-relevant problems in key areas of ESSOS, consider disseminating about your experience at our demonstration session.


If you are interested please send me an email (Luca Compagna, with a short description of the demo you would like to present. Details can be found on the ESSOS call-for-papers ( Below I report the main guidelines. Deadline is October 24th. If you have any question/comment, please feel free to come back to me.


Demo presentation (short description, max 4 pages, not published in ESSOS proceedings) - May shortly describe (i) the overall problem, (ii) the architecture underlying the system demonstrated, and (iii) one or more use case scenarios that present how the audience will gain an understanding of the underlying technology. Submissions will be evaluated based on the motivation of the work behind the use of the system to be demonstrated and its novelty. Demo presentations will not be included in the formal proceeding of ESSOS.


Looking forward to receiving your proposals.

Best regards,



Om-announce mailing list
Luca | 16 Oct 08:06 2014


		Thirteenth International Conference on

		 1 July - 3 July 2015, Warsaw, Poland
	    (co-located with RTA 2015 as part of RDP 2015)

The 13th International Conference on Typed Lambda Calculi
and Applications (TLCA 2015) is a forum for original
research in the theory and applications of typed lambda
calculus, broadly construed.
Suggested, but not exclusive, list of topics for submission are:

- Proof-theory: natural deduction, sequent calculi, cut elimination
   and normalization, propositions as types, linear logic and proof
   nets, type-theoretic aspects of computational complexity
- Semantics: denotational semantics, game semantics, realisability,
    domain theory, categorical models, higher order semantics of
    natural language
- Types: subtypes, dependent types, polymorphism, inductive,
    coinductive and recursive types, intersection types and related
    approaches, type inference and type checking, types in program
    analysis and verification, types in proof assistants, homotopy type
- Programming: foundational aspects of functional programming,
    object-oriented programming and other programming paradigms,
    calculi for higher order concurrency (e.g. pi-calculus),
    flow analysis of higher-type computation, program equivalence,
    program transformation and optimization
- Typed lambda calculi in education, proof systems based on lambda
    calculus to teach mathematics, lambda calculi as a unified notation
    in scientific education


We solicit submissions of research papers, which must:
- be in English and not exceed 15 pages (including figures and
   bibliography). Additional material intended for the reviewers
   but not for publication in the final version - for example
   details of proofs - may be placed in a clearly marked appendix
   that is not included in the page limit. Reviewers will be told
   that they may choose to ignore the appendix.
- present original research which is unpublished and not submitted
    elsewhere (conferences, journals, books, etc.)
- use LIPIcs latex style
- be submitted electronically in PDF via theEasyChair TLCA
   2015 Submission Webpage (will open nearer the deadline).

Submissions deviating from these instructions may be rejected without
review. A condition of submission is that, if accepted, one of the
authors must attend the conference to give the presentation.  The
proceedings will be published as an electronic volume in the Leibniz
International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl.
Note that LIPIcs is open access and hence publications automatically
satisfy the requirements many research councils impose on

Any questions regarding the submission guidelines should be directed
to the Programme Committee Chair prior to submitting.


TLCA 2015 is organized as part of the Federated Conference on
Rewriting, Deduction, and Programming (RDP 2015), together with
the International Conference on Rewriting Techniques and
Applications (RTA 2015) and several related events. Details on
workshops affiliated with RDP 2015 will be available at the web
site in due course.

Abstract Deadline:		30 January 2015
Submission Deadline:	6 February 2015
Notification:		  	2 April 2015
Camera-Ready:		17 April 2015


Thorsten Altenkirch (U Nottingham)
tlca2015@... <at>


Steve Awodey				(Carnegie Mellon U)
Stefano Berardi 			(U Torino)
James Chapman 			(TU Tallinn)
Gilles Dowek				(INRIA)
Peter Dybjer 				(Chalmers U)
Silvia Ghilezan 			(U Novi Sad)
Mauro Jaskelioff 			(U Rosario)
Chantal Keller 				(MSR Cambridge)
Paul Levy 				(U Birmingham)
Ralph Matthes 			(IRIT, CNRS  U Toulouse)
Keiko Nakata 				(TU Tallinn)
Damian Niwinski			(U Warsaw)
Valeria de Paiva			(Nuance Communications)
Matthieu Sozeau 			(INRIA)
Wouter Swierstra 			(U Utrecht)


Aleksy Schubert (U Warsaw)


Sandra Alves (U Porto)
Steve Awodey, (CMU)
Pierre-Louis Curien (CNRS/U Paris Diderot)
Ugo Dal Lago (U Bologna)
Gilles Dowek (INRIA)
Masahito Hasegawa (U Kyoto)
Hugo Herbelin (U Denis Diderot)
Martin Hofmann (LMU Munchen)
Luke Ong (U Oxford)
Michele Pagani (U Denis Diderot)
Jens Palsberg  (UCLA)
Jakob Rehof (U Dortmund)
Pawel Urzyczyn (U Warsaw), chair
Philip Wadler (U Edinburgh)


Samson Abramsky (U Oxford)
Henk Barendregt (U Nijmegen)
Mariangiola Dezani (U Torino)
  Roger Hindley (Swansea U)
Simona Ronchi Della Rocca (U Torino)


Luca Paolini (U Torino)
Geoff Sutcliffe | 15 Oct 14:37 2014

CADE-25 Call for Papers, etc.



25th International Conference on Automated Deduction (CADE-25)
Berlin, Germany, 1-7 August 2015

Submission deadlines:

   14 November 2014 (workshops/tutorials/competitions)
16/23 February 2015 (papers)

CADE is the major international forum at which research on all aspects of
automated deduction is presented. The 25th jubilee edition will feature
a special session on the past, present, and future of automated deduction

  Ursula Martin      University of Oxford
  Frank Pfenning     Carnegie Mellon University
  David Plaisted     University of North Carolina at Chapel Hill
  Andrei Voronkov    University of Manchester

as invited speakers. In addition, there will be invited presentations by

  Ulrich Furbach     University of Koblenz
  Edward Zalta       Stanford University


Workshop proposals for CADE-25 are solicited. Both well-established
workshops and newer ones are encouraged. Similarly, proposals for workshops
with a tight focus on a core automated reasoning specialization, as well as
those with a broader, more applied focus, are very welcome.

Please provide the following information in your application document:

+ Workshop title.
+ Names and affiliations of organizers.
+ Proposed workshop duration (from half a day to two days) and preferred
+ Brief description of the goals and the scope of the workshop. Why is the
  workshop relevant for CADE?
+ Is the workshop new or has it met previously? In the latter case
  information on previous meetings should be given (e.g., links to the
  program, number of submissions, number of participants).
+ What are the plans for publication?


Tutorial proposals for CADE-25 are solicited. Tutorials are expected to be
half-day events, with a theoretical or applied focus, on a topic of interest
for CADE-25. Proposals should provide the following information:

+ Tutorial title.
+ Names and affiliations of organizers.
+ Brief description of the tutorial's goals and topics to be covered.
+ Whether or not a version of the tutorial has been given previously.

CADE will take care of printing and distributing notes for tutorials that
would like this service.


The CADE ATP System Competition (CASC), which evaluates automated theorem
proving systems for classical logics, has become an integral part of the
CADE conferences.

Further system competition proposals are solicited. The goal is to foster
the development of automated reasoning systems in all areas relevant for
automated deduction in a broader sense. Proposals should include the
following information:

+ Competition title.
+ Names and affiliations of organizers.
+ Duration and schedule of the competition.
+ Room/space requirements.
+ Description of the competition task and the evaluation procedure.
+ Is the competition new or has it been organized before?
  In the latter case information on previous competitions should be given.
+ What computing resources are required and how will they be provided?


High-quality submissions on the general topic of automated deduction,
including foundations, applications, implementations, and practical
experiences are solicited.

* Logics of interest include propositional, first-order, equational,
  higher-order, classical, description, modal, temporal, many-valued,
  constructive, other non-classical, meta-logics, logical frameworks, type
  theory, set theory, as well as any combination thereof.

* Paradigms of interest include theorem proving, model building, constraint
  solving, computer algebra, model checking, proof checking, and their

* Methods of interest include resolution, superposition, completion,
  saturation, term rewriting, decision procedures, model elimination,
  connection methods, tableaux, sequent calculi, natural deduction, as
  well as their supporting algorithms and data structures, including
  matching, unification, orderings, induction, indexing techniques, proof
  presentation and explanation, proof planning.

* Applications of interest include program analysis, verification and
  synthesis of software and hardware, formal methods, computational logic,
  computer mathematics, natural language processing, computational
  linguistics, knowledge representation, ontology reasoning, deductive
  databases, declarative programming, robotics, planning, and other areas
  of AI.

Submissions can be made in the categories regular papers and system
descriptions. The page limit in Springer LNCS style is 15 pages for regular
papers and 10 pages for system descriptions. Submissions must be unpublished
and not submitted for publication elsewhere. They will be judged on
relevance, originality, significance, correctness, and readability. System
descriptions should contain a link to a working system and will also be
judged on usefulness and design. Proofs of theoretical results that do not
fit in the page limit, executables of systems, and input data of experiments
should be made available, via a reference to a website or in an appendix of
the paper. Reviewers will be encouraged to consider this additional
material, but submissions must be self-contained within the respective page
limit; considering the additional material should not be necessary to
assess the merits of a submission. The proceedings of the conference will
be published in the Springer LNCS/LNAI series. Formatting instructions and
the LNCS style files can be obtained at

At every CADE conference the Program Committee selects one of the
accepted papers to receive the CADE Best Paper Award. The award
recognizes a paper that the Program Committee collegially evaluates as
the best in terms of originality and significance, having substantial
confidence in its correctness. Overall technical quality,
completeness, scholarly accuracy, and readability are also
considered. Characteristics associated with a best paper include, for
instance, introduction of a strong new technique or approach, solution
of a long-standing open problem, introduction and solution of an
interesting and important new problem, highly innovative application
of known ideas or existing techniques, and presentation of a new
system of outstanding power. Under exceptional circumstances, the
Program Committee may give two awards (ex aequo) or give no award.

At CADE-25 we also intend to award the best student paper (details
will follow).


Workshop/Tutorials/System Competitions:

Submission deadline:      14 November 2014
Notification:             28 November 2014


Abstract deadline:        16 February 2015
Submission deadline:      23 February 2015
Rebuttal phase:           15-18 April 2015
Notification:             26 April 2015
Final version:            17 May 2015

Workshops and Tutorials:  1 August to 3 August (morning) 2015
Competitions:             1 to 7 August 2015
Conference:               3 August (afternoon) to 7 August 2015


Proposals for workshops, tutorials, and system competitions should be
uploaded via

Papers should be submitted via


Conference Chair:
  Christoph Benzmüller   Freie Universität Berlin

Program Committee Co-Chairs:
  Amy Felty              University of Ottawa
  Aart Middeldorp        University of Innsbruck

Workshop, Tutorial, and Competition Co-Chairs:
  Jasmin Blanchette      Technische Universität München
  Andrew Reynolds        EPFL Lausanne

Publicity and Web Chair:
  Julian Röder           Freie Universität Berlin

Program Committee
  Carlos Areces          Universidad Nacional de Córdoba
  Alessandro Armando     University of Genova
  Christoph Benzmüller   Freie Universität Berlin
  Josh Berdine           Microsoft Research
  Jasmin Blanchette      Technische Universität München
  Marta Cialdea Mayer    Universita di Roma Tre
  Stephanie Delaune      CNRS
  Gilles Dowek           Inria
  Amy Felty              University of Ottawa
  Reiner Hähnle          Technical University of Darmstadt
  Stefan Hetzl           Vienna University of Technology
  Marijn Heule           The University of Texas at Austin
  Nao Hirokawa           JAIST
  Ullrich Hustadt        University of Liverpool
  Deepak Kapur           University of New Mexico
  Gerwin Klein           NICTA and UNSW
  Laura Kovács           Chalmers University of Technology
  Carsten Lutz           Universität Bremen
  Assia Mahboubi         Inria
  Aart Middeldorp        University of Innsbruck
  Albert Oliveras        Technical University of Catalonia
  Nicolas Peltier        CNRS
  Brigitte Pientka       McGill University
  Ruzica Piskac          Yale University
  André Platzer          Carnegie Mellon University
  Andrew Reynolds        EPFL Lausanne
  Christophe Ringeissen  LORIA-INRIA
  Renate Schmidt         University of Manchester
  Stephan Schulz         DHBW Stuttgart
  Georg Struth           University of Sheffield
  Geoff Sutcliffe        University of Miami
  Alwen Tiu              Nanyang Technological University
  Freek Wiedijk          Radboud University Nijmegen
Om-announce mailing list
vsim | 10 Oct 23:10 2014

[simu-conf] SpringSim 2015 - Deadline approaching

SpringSim 2015 - Deadline Approaching

The 2015 Spring Simulation Multi-Conference (SpringSim'15) is an annual
conference sponsored by SCS which covers state-of-the-art developments
in computer simulation technologies, as well as scientific, industrial,
and business applications. With over 220 abstracts submitted up to date,
keynotes, student activities, vendor and turorial trackls, SpringSim
2015 promises to be one of the most exciting events to attend in 2015.

The following symposia will take place at SpringSim 2015:

*	Agent-Directed Simulation Symposium (ADS)
*	Annual Simulation Symposium (ANSS) 
*	Communications and Networking Symposium (CNS)
*	High Performance Computing Symposium (HPC)
*	Symposium on Simulation for Architecture and Urban Design
*	Symposium on Theory of Modeling & Simulation (TMS)
*	Modeling and Simulation in Medicine (MSM)
*	Student Modeling & Simulation Mobile App Competition
*	Posters & Student Colloquium
*	Tutorial Track
*	Vendor Track


Abstract Submission (Non-Mandatory) - October 15, 2014
Full Paper Submission - November 10-22, 2014
Notification of Acceptance - January 9, 2015
Camera-Ready Paper Due - February 10, 2015


Modeling and Simulation in Medicine (MSM)

Track Chair: Jerzy W. Rozenblit, University of Arizona, USA
Program Chair: Johannes (Sam) Sametinger, Kepler University, Linz,


The symposium will focus on (but is not limited to) the following
topical areas:
*	Modeling and simulation in medicine: fundamental research
*	Training and education
*	Care delivery, outcomes, and patient's safety
*	Robotics and its applications in training and "in vivo"
*	Life-critical systems
*	Systems integration: "connected health" 

[apologies for multiple postings 
- comments issues: vsim-conf-owner@...]
Sophie Tison | 13 Oct 08:17 2014

RTA 2015 - First Call For Papers

              RTA 2015 - CALL FOR PAPERS 
           26th International Conference on
        29 June - 1 July, 2015, Warsaw, Poland 
      co-located with TLCA, as part of RDP 2015

RTA is the major forum for the presentation of research on all 
aspects of rewriting.  Topics of interest include:

* Foundations: string, term, net and graph rewriting; higher-order
rewriting; binding techniques; constrained rewriting and deduction;
categorical and infinitary rewriting; stochastic rewriting;
higher-dimensional rewriting; tree automata; confluence; 
termination; complexity; modularity; equational logic; 
universal algebra; rewriting logic; rewriting calculi.

* Algorithmic aspects and implementation: strategies; matching;
unification; anti-unification; narrowing; completion; parallel
execution; certification of rewriting properties; abstract machines;
automated (non)termination and confluence provers; automated
complexity analysis; system descriptions.

* Applications of rewriting: programming languages (functional, 
logic, object-oriented and other programming paradigms); type 
systems; program analysis, transformation and optimisation; 
rewriting models of programs; semantics; process calculi; 
functional calculi; explicit substitution; constraint solving; 
symbolic and algebraic computation; theorem proving; 
proof checking; system modelling; system synthesis and 
verification; XML queries and transformations; cryptographic 
protocols; security policies; systems biology; linguistics; 
rewriting in education.

Important Dates:
# Submission: title and abstract: 30 January 2015
              full paper: 6 February 2015
# Rebuttal period: 19-21 March 2015  
# Notification:    8 April 2015
# Final version:  25 April 2015

Submission and publication:
The RTA 2015 proceedings will be published by LIPIcs (Leibniz
International Proceedings in Informatics). Papers should present
original work, and should be submitted via Easychair:
Papers should be at most 15 pages (10 for system descriptions) 
in the style described in: 
This year we particularly welcome submissions on applications of
rewriting. Application papers are regular papers (15 pages); their
originality is judged based on the novelty of the application or the
depth of the rewriting methods applied. 
System description papers present new software tools in which 
rewriting plays an important role, or significantly new versions 
of such tools. The paper should also include an evaluation of the 

Programme Committee:
M. Ayala-Rincon, U. Brasilia
H. Cirstea, Loria Nancy
S. Delaune, ENS Cachan
A. Di Pierro, U. Verona
G. Dowek, Inria
M. Fernandez, KCL, chair
J. Giesl, RWTH Aachen U.
M. Hanus, CAU Kiel
D. Kesner, U. Paris-Diderot
T. Kutsia, Johannes Kepler U. Linz
J. Levy, IIIA-CSIC Barcelona
S. Lucas, Polytechnic U. Valencia
C. Lynch, Clarkson U.
I. Mackie, E. Polytechnique
G. Moser, U. Innsbruck
D. Plump, U. York
F. van Raamsdonk, VU Amsterdam
K. Rose, Two Sigma, US
M. Sakai, Nagoya U.
A. Scedrov, U. Pennsylvania
M. Schmidt-Schauss, U. Frankfurt
C. Schuermann, ITU Copenhagen	
P. Selinger, Dalhousie U.
P. Severi, U. Leicester
K. Ueda, Waseda U.

Conference Chair:
Aleksy Schubert
Warsaw University

For more information, please contact the PC chair:

Pr. Sophie Tison (RTA publicity chair)
LIFL - University of Lille- CNRS

Attachment (smime.p7s): application/pkcs7-signature, 3818 bytes
Om-announce mailing list
Shui Yu | 13 Oct 03:13 2014

IEEE INFOCOM 15 Workshop of BigSecurity with Special Issue Information

We apology for possible cross posting


The Third International Workshop on Security and Privacy in Big Data  (in conjunction with IEEE INFOCOM 2015)   

As we are deep into the Information Age, we also witness the explosive growth of data available on the Internet. Human beings have created quintillion bytes of data every day, which come from sensors, individual archives, social networks, Internet of Things, enterprise and Internet in all scales and formats. We face one of the most challenging issues, i.e., how to effectively manage such a large amount of data and identify new ways to analyze large amounts of data and unlock information. The issue is also known as Big Data, which has been emerging as a hot topic in Information and Communication Technologies (ICT) research.  Security and privacy issue is critical for Big Data. Many works have been carried out focusing on business, application and information processing level from big data, such as data mining and analysis.  However, security and privacy issues in Big Data are seldom mentioned to date. Due to its extraordinary scale, security and privacy in Big Data faces many challenges, such as efficient encryption and decryption algorithms, encrypted information retrieval, attribute based encryption, attacks on availability, reliability and integrity of Big Data.


The purpose of this workshop is to offer a timely venue for researchers and industry partners to present and discuss their latest results in security and privacy related work of Big Data. 

The topics of interest include, but are not limited to: 

·         Threat and Vulnerability Analysis in Big Data

·         Architecture for Security and Privacy in Big Data

·         Encrypted Information Retrieval in Big Data

·         Cryptanalysis and Applications in Big Data

·         Lightweight Cryptographic Algorithms in Big Data

·         Trust in Big Data

·         Network Security, Privacy in Big Data

·         Network Forensics in Big Data

·         Anonymous Communication in Big Data

·         Physical Layer Security in Big Data

·         Privacy and Security in Cloud Data

·         Privacy and Security in Data Center Networks

·         Application Level Security and Privacy in Big Data

·         Attacks and Counter Measures in Big Data

·         Information Forensics in Big Data

·         Secure Cross-layer Design in Big Data

·         Identity Management and Key Management in Big Data

·         Intrusion Detection and Response in Big Data

·         Security and Privacy in Complex Networks

·         Malware and Virus Detection in Big Data

·         Biometric Security and Forensics in Big Data

·         Reliability and Availability in Big Data

·         Network Security in Big Data

·         Network Privacy in Big Data

·         Security and Privacy Theories in Big Data


General Co-chairs

Professor Ivan Stojmenovic, University of Ottawa, Canada

Professor Jian Pei, Simon Fraser University, Canada


Technical Program Co-chairs

Dr Shui Yu, Deakin University, Australia

Professor Ke Liu, National Natural Science Foundation of China, China


Submission Instructions are available to the workshop website.


*High quality papers from this workshop will be invited to extend and submit to the special issue on Big Data from Network Perspective on Elsevier Journal of Big Data Research (, organized by the workshop organizers).


Important Dates

Submission Deadline: December 15, 2014

Authors Notification:  January 15, 2015

Final Manuscript Due: February 15, 2015

Workshop Date: April 27, 2015


Enquiries should be submitted to Dr Shui Yu (syu <at> 



Shui YU, PhD, Senior Lecturer

School of Information Technology, Deakin University,

221 Burwood Highway, Burwood, VIC 3125,  Australia.

Telephone:0061 3 9251 7744

Om-announce mailing list