[TYPES/announce] (Deadline extended to Feb 7th, 2022) LangSec 2022, affiliated with IEEE S&P

[Gang (Gary) Tan]

We are extending the LangSec 2022 deadline to Feb 7th, 2022; we hope to 
see your submission this year!

Apologies for multiple postings.

Call for Papers
8th Workshop on Language-Theoretic Security (LangSec)
Affiliated with 43rd IEEE Symposium on Security and Privacy (Oakland)
May 26th, 2022

The Language-Theoretic Security (LangSec) workshop solicits
contributions of research papers, work-in-progress reports, and panels
related to the growing area of language-theoretic security.

Submission Guidelines: see https://urldefense.com/v3/__http://langsec.org/spw22/__;!!IBzWLUs!DOlkoY5jWMp9SEdrC3ExgtCK_0xuFb5AQjITpz4Fh0OHIpe88cQtF_FHx77dt0VRS9QcfY1-D4Vypg$ 

Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=langsec2022__;!!IBzWLUs!DOlkoY5jWMp9SEdrC3ExgtCK_0xuFb5AQjITpz4Fh0OHIpe88cQtF_FHx77dt0VRS9QcfY3-_2JX8w$ 

Important Dates:
Research paper submissions due: Feb 7th 2022, AOE
Work-in-progress reports and panels submissions due:
   Feb 7th 2022, AOE
Notification to authors: Feb 28th 2022
Camera ready: March 17th 2022

Topics: LangSec posits that the only path to trustworthy computer
software that takes untrusted inputs is treating all valid or expected
inputs as a formal language, and the respective input-handling routine
as a parser for that language. The parsing must be feasible, and the
parser must match the language in required computation power and
convert the input for the consumption of subsequent computation. The
7th installation of the workshop will continue the tradition and
further focus on research that apply the language-theoretic
perspective to policy mechanisms, such as treating policy formulation
and enforcement as language definition and language recognition
problems. The following is a non-exhaustive list of topics that are of
relevance to LangSec:

* formalization of vulnerabilities and exploits in terms of language
   theory
* inference of formal language specifications of data from samples
* generation of secure parsers from formal language specifications
* complexity hierarchy of verifying parser implementations
* science of protocol design: layering, fragmentation and re-assembly,
   extensibility, etc.
* architectural constructs for enforcing limits on computational
   complexity
* empirical data on programming language features/programming styles
   that affect bug introduction rates (e.g., syntactic redundancy)
* systems architectures and designs based on LangSec principles
* computer languages, file formats, and network protocols built on
   LangSec principles
* re-engineering efforts of existing languages, formats, and protocols
   to reduce computational power

Chairs
PC co-chair: Gang Tan (Pennsylvania State University)
PC co-chair: Sergey Bratus (Dartmouth College)

Contact:
All questions about submissions should be emailed to the PC chairs:
Gang Tan (gtan at psu.edu) and Sergey Bratus (sergey at cs.dartmouth.edu)

-- 

Gang (Gary) Tan
Professor, Penn State CSE and ICDS
W358 Westgate Building
https://urldefense.com/v3/__http://www.cse.psu.edu/*gxt29__;fg!!IBzWLUs!DOlkoY5jWMp9SEdrC3ExgtCK_0xuFb5AQjITpz4Fh0OHIpe88cQtF_FHx77dt0VRS9QcfY3ejQz_DA$ 
Tel:814-8657364
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://LISTS.SEAS.UPENN.EDU/pipermail/types-announce/attachments/20220113/5d8577fd/attachment.htm>